Implementation Considerations for Higher-order Features in Logic Programming Implementation Considerations for Higher-order Features in Logic Programming Running Title: Higher-order Features in Logic Programming

This paper examines implementation problems that arise from providing for aspects of higher-order programming within and enhancing the metalanguage abilities of logic programming. One issue of concern is a representation for the simply-typed lambda terms that replace the usual rst-order terms as data structures; this representation must support an eecient realization of-conversion operations on these terms. Another issue is the handling of higher-order uniication that becomes an integral part of the computational model. An implementation must cater to the branching nature of this operation and also provide a means for temporarily suspending the solution of a uniication problem. A nal issue concerns the treatment of goals whose structure is not statically apparent. These problems are discussed in detail and solutions to them are described. A representation for lambda terms is presented that uses the de Bruijn \nameless" notation and also permits reduction substitutions to be performed lazily. This notation obviates-conversion and also supports an eecient implementation of-reduction. Branching in uniication is implemented by using a depth-rst search strategy with backtracking. A structure that is called a branch point record and is akin to the choice point record of the Warren Abstract Machine (WAM) is described for remembering alternatives in uniication. An explicit representation for uniication problems is presented that permits sharing and also supports the rapid reinstatement of earlier versions of the problem. The implementation of uniication is tuned to yield an eecient solution to rst-order like problems, in fact through the use of compiled code as in the WAM. A compilation method is also discussed for goals whose structure changes during execution. The various ideas presented here form part of an ongoing implementation of a higher-order logic programming language called Prolog.